0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.12 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM 0.12/0.33 % Computer : n016.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1920 0.12/0.33 % WCLimit : 240 0.12/0.33 % DateTime : Wed Jul 30 08:57:49 EDT 2025 0.12/0.33 % CPUTime : 0.20/0.47 Running higher-order theorem proving 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.KDJ3peRAFa/E---3.1_30026.p 1.28/0.65 # Version: 3.0.0-ho 1.28/0.65 # Preprocessing class: HSLSSMSMSSSNSFA. 1.28/0.65 # Scheduled 6 strats onto 8 cores with 240 seconds (1920 total) 1.28/0.65 # Starting new_ho_10 with 720s (3) cores 1.28/0.65 # Starting sh2lt with 240s (1) cores 1.28/0.65 # Starting new_ho_5 with 240s (1) cores 1.28/0.65 # Starting full_lambda_5 with 240s (1) cores 1.28/0.65 # Starting sh9 with 240s (1) cores 1.28/0.65 # Starting ehoh_best8_lambda with 240s (1) cores 1.28/0.65 # sh2lt with pid 30105 completed with status 0 1.28/0.65 # Result found by sh2lt 1.28/0.65 # Preprocessing class: HSLSSMSMSSSNSFA. 1.28/0.65 # Scheduled 6 strats onto 8 cores with 240 seconds (1920 total) 1.28/0.65 # Starting new_ho_10 with 720s (3) cores 1.28/0.65 # Starting sh2lt with 240s (1) cores 1.28/0.65 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true) 1.28/0.65 # Search class: HGHSM-FFMS33-MSFFFFNN 1.28/0.65 # partial match(3): FGHSM-FFMS31-MFFFFFNN 1.28/0.65 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 1.28/0.65 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 104s (1) cores 1.28/0.65 # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 30111 completed with status 0 1.28/0.65 # Result found by G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y 1.28/0.65 # Preprocessing class: HSLSSMSMSSSNSFA. 1.28/0.65 # Scheduled 6 strats onto 8 cores with 240 seconds (1920 total) 1.28/0.65 # Starting new_ho_10 with 720s (3) cores 1.28/0.65 # Starting sh2lt with 240s (1) cores 1.28/0.65 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true) 1.28/0.65 # Search class: HGHSM-FFMS33-MSFFFFNN 1.28/0.65 # partial match(3): FGHSM-FFMS31-MFFFFFNN 1.28/0.65 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 1.28/0.65 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 104s (1) cores 1.28/0.65 # Preprocessing time : 0.002 s 1.28/0.65 1.28/0.65 # Proof found! 1.28/0.65 # SZS status Theorem 1.28/0.65 # SZS output start CNFRefutation 1.28/0.65 thf(decl_sort1, type, del: $tType). 1.28/0.65 thf(decl_23, type, bool: del). 1.28/0.65 thf(decl_25, type, arr: del > del > del). 1.28/0.65 thf(decl_26, type, mem: $i > del > $o). 1.28/0.65 thf(decl_27, type, ap: $i > $i > $i). 1.28/0.65 thf(decl_29, type, p: $i > $o). 1.28/0.65 thf(decl_32, type, c_2EquantHeuristics_2EGUESS__FORALL__GAP: del > del > $i). 1.28/0.65 thf(decl_33, type, c_2EquantHeuristics_2EGUESS__EXISTS__GAP: del > del > $i). 1.28/0.65 thf(decl_34, type, c_2EquantHeuristics_2EGUESS__FORALL__POINT: del > del > $i). 1.28/0.65 thf(decl_35, type, c_2EquantHeuristics_2EGUESS__EXISTS__POINT: del > del > $i). 1.28/0.65 thf(decl_36, type, c_2EquantHeuristics_2EGUESS__FORALL: del > del > $i). 1.28/0.65 thf(decl_38, type, c_2EquantHeuristics_2EGUESS__EXISTS: del > del > $i). 1.28/0.65 thf(decl_49, type, epred4_4: $i > $i > del > del > $o). 1.28/0.65 thf(decl_50, type, esk1_0: del). 1.28/0.65 thf(decl_51, type, esk2_0: del). 1.28/0.65 thf(decl_52, type, esk3_0: $i). 1.28/0.65 thf(decl_53, type, esk4_0: $i). 1.28/0.65 thf(decl_54, type, esk5_0: $i). 1.28/0.65 thf(decl_56, type, esk7_4: del > del > $i > $i > $i). 1.28/0.65 thf(decl_57, type, esk8_5: del > del > $i > $i > $i > $i). 1.28/0.65 thf(decl_58, type, esk9_6: del > del > $i > $i > $i > $i > $i). 1.28/0.65 thf(decl_59, type, esk10_7: del > del > $i > $i > $i > $i > $i > $i). 1.28/0.65 thf(decl_60, type, esk11_6: del > del > $i > $i > $i > $i > $i). 1.28/0.65 thf(decl_61, type, esk12_6: del > del > $i > $i > $i > $i > $i). 1.28/0.65 thf(decl_62, type, esk13_7: del > del > $i > $i > $i > $i > $i > $i). 1.28/0.65 thf(decl_63, type, esk14_6: del > del > $i > $i > $i > $i > $i). 1.28/0.65 thf(decl_64, type, esk15_5: del > del > $i > $i > $i > $i). 1.28/0.65 thf(decl_65, type, esk16_4: del > del > $i > $i > $i). 1.28/0.65 thf(decl_66, type, epred5_0: $o). 1.28/0.65 thf(decl_67, type, epred6_0: $o). 1.28/0.65 thf(conj_thm_2EquantHeuristics_2EGUESS__REWRITES, axiom, ![X11:del, X12:del, X13:$i]:((![X14:$i]:(((mem @ X14 @ (arr @ X12 @ bool))=>((((((![X23:$i]:(((mem @ X23 @ X12)=>(?[X24:$i]:(((p @ (ap @ X14 @ (ap @ X13 @ X24)))&(mem @ X24 @ X11)))<=(p @ (ap @ X14 @ X23)))))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X11 @ X12) @ X13) @ X14)))&![X25:$i]:((![X26:$i]:(((![X27:$i]:(((mem @ X27 @ X11)=>(p @ (ap @ X26 @ (ap @ X25 @ X27)))))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X11 @ X12) @ X25) @ X26)))<=(mem @ X26 @ (arr @ X12 @ bool))))<=(mem @ X25 @ (arr @ X11 @ X12)))))&![X28:$i]:((![X29:$i]:(((mem @ X29 @ (arr @ X12 @ bool))=>((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X11 @ X12) @ X28) @ X29))<=>![X30:$i]:((((p @ (ap @ X29 @ X30))=>?[X31:$i]:(((mem @ X31 @ X11)&((X30)=(ap @ X28 @ X31)))))<=(mem @ X30 @ X12))))))<=(mem @ X28 @ (arr @ X11 @ X12)))))&![X32:$i]:((![X33:$i]:(((![X34:$i]:(((mem @ X34 @ X12)=>(?[X35:$i]:((((X34)=(ap @ X32 @ X35))&(mem @ X35 @ X11)))<=~((p @ (ap @ X33 @ X34))))))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X11 @ X12) @ X32) @ X33)))<=(mem @ X33 @ (arr @ X12 @ bool))))<=(mem @ X32 @ (arr @ X11 @ X12)))))&![X36:$i]:((![X37:$i]:(((![X38:$i]:((~((p @ (ap @ X37 @ (ap @ X36 @ X38))))<=(mem @ X38 @ X11)))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X11 @ X12) @ X36) @ X37)))<=(mem @ X37 @ (arr @ X12 @ bool))))<=(mem @ X36 @ (arr @ X11 @ X12)))))&((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X11 @ X12) @ X13) @ X14))<=>![X39:$i]:(((?[X40:$i]:(((mem @ X40 @ X11)&~((p @ (ap @ X14 @ (ap @ X13 @ X40))))))<=~((p @ (ap @ X14 @ X39))))<=(mem @ X39 @ X12)))))))<=(mem @ X13 @ (arr @ X11 @ X12)))), file('/export/starexec/sandbox2/tmp/tmp.KDJ3peRAFa/E---3.1_30026.p', conj_thm_2EquantHeuristics_2EGUESS__REWRITES)). 1.28/0.65 thf(conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT, conjecture, ![X11:del, X12:del, X13:$i]:(((mem @ X13 @ (arr @ X12 @ X11))=>![X14:$i]:((![X15:$i]:(((mem @ X15 @ (arr @ X11 @ bool))=>(![X16:$i]:((((p @ (ap @ X14 @ X16))<=(p @ (ap @ X15 @ X16)))<=(mem @ X16 @ X11)))=>((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X12 @ X11) @ X13) @ X15))<=(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X12 @ X11) @ X13) @ X14))))))<=(mem @ X14 @ (arr @ X11 @ bool)))))), file('/export/starexec/sandbox2/tmp/tmp.KDJ3peRAFa/E---3.1_30026.p', conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT)). 1.28/0.65 thf(ap_tp, axiom, ![X1:del, X2:del, X6:$i]:((![X4:$i]:(((mem @ X4 @ X1)=>(mem @ (ap @ X6 @ X4) @ X2)))<=(mem @ X6 @ (arr @ X1 @ X2)))), file('/export/starexec/sandbox2/tmp/tmp.KDJ3peRAFa/E---3.1_30026.p', ap_tp)). 1.28/0.65 thf(c_0_3, plain, ![X11:del, X12:del, X14:$i, X13:$i]:(((epred4_4 @ X13 @ X14 @ X11 @ X12)<=>((((((![X23:$i]:(((mem @ X23 @ X12)=>((p @ (ap @ X14 @ X23))=>?[X24:$i]:(((p @ (ap @ X14 @ (ap @ X13 @ X24)))&(mem @ X24 @ X11))))))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X11 @ X12) @ X13) @ X14)))&![X25:$i]:(((mem @ X25 @ (arr @ X11 @ X12))=>![X26:$i]:(((mem @ X26 @ (arr @ X12 @ bool))=>(![X27:$i]:(((mem @ X27 @ X11)=>(p @ (ap @ X26 @ (ap @ X25 @ X27)))))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X11 @ X12) @ X25) @ X26))))))))&![X28:$i]:(((mem @ X28 @ (arr @ X11 @ X12))=>![X29:$i]:(((mem @ X29 @ (arr @ X12 @ bool))=>((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X11 @ X12) @ X28) @ X29))<=>![X30:$i]:(((mem @ X30 @ X12)=>((p @ (ap @ X29 @ X30))=>?[X31:$i]:(((mem @ X31 @ X11)&((X30)=(ap @ X28 @ X31)))))))))))))&![X32:$i]:(((mem @ X32 @ (arr @ X11 @ X12))=>![X33:$i]:(((mem @ X33 @ (arr @ X12 @ bool))=>(![X34:$i]:(((mem @ X34 @ X12)=>(~(p @ (ap @ X33 @ X34))=>?[X35:$i]:((((X34)=(ap @ X32 @ X35))&(mem @ X35 @ X11))))))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X11 @ X12) @ X32) @ X33))))))))&![X36:$i]:(((mem @ X36 @ (arr @ X11 @ X12))=>![X37:$i]:(((mem @ X37 @ (arr @ X12 @ bool))=>(![X38:$i]:(((mem @ X38 @ X11)=>~(p @ (ap @ X37 @ (ap @ X36 @ X38)))))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X11 @ X12) @ X36) @ X37))))))))&((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X11 @ X12) @ X13) @ X14))<=>![X39:$i]:(((mem @ X39 @ X12)=>(~(p @ (ap @ X14 @ X39))=>?[X40:$i]:(((mem @ X40 @ X11)&~(p @ (ap @ X14 @ (ap @ X13 @ X40)))))))))))), introduced(definition)). 1.28/0.65 thf(c_0_4, plain, ![X11:del, X12:del, X13:$i]:(((mem @ X13 @ (arr @ X11 @ X12))=>![X14:$i]:(((mem @ X14 @ (arr @ X12 @ bool))=>(epred4_4 @ X13 @ X14 @ X11 @ X12))))), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[conj_thm_2EquantHeuristics_2EGUESS__REWRITES]), c_0_3])). 1.28/0.65 thf(c_0_5, plain, (~((epred6_0))<=>![X6:$i, X8:$i]:(~((epred4_4 @ X6 @ X8 @ esk2_0 @ esk1_0)))), introduced(definition)). 1.28/0.65 thf(c_0_6, plain, ![X183:del, X184:del, X185:$i, X186:$i]:((~(mem @ X185 @ (arr @ X183 @ X184))|(~(mem @ X186 @ (arr @ X184 @ bool))|(epred4_4 @ X185 @ X186 @ X183 @ X184)))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])). 1.28/0.65 thf(c_0_7, negated_conjecture, ~(![X11:del, X12:del, X13:$i]:(((mem @ X13 @ (arr @ X12 @ X11))=>![X14:$i]:(((mem @ X14 @ (arr @ X11 @ bool))=>![X15:$i]:(((mem @ X15 @ (arr @ X11 @ bool))=>(![X16:$i]:(((mem @ X16 @ X11)=>((p @ (ap @ X15 @ X16))=>(p @ (ap @ X14 @ X16)))))=>((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X12 @ X11) @ X13) @ X14))=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X12 @ X11) @ X13) @ X15))))))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT])])). 1.28/0.65 thf(c_0_8, plain, ![X11:del, X12:del, X14:$i, X13:$i]:(((epred4_4 @ X13 @ X14 @ X11 @ X12)=>((((((![X23:$i]:(((mem @ X23 @ X12)=>((p @ (ap @ X14 @ X23))=>?[X24:$i]:(((p @ (ap @ X14 @ (ap @ X13 @ X24)))&(mem @ X24 @ X11))))))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X11 @ X12) @ X13) @ X14)))&![X25:$i]:(((mem @ X25 @ (arr @ X11 @ X12))=>![X26:$i]:(((mem @ X26 @ (arr @ X12 @ bool))=>(![X27:$i]:(((mem @ X27 @ X11)=>(p @ (ap @ X26 @ (ap @ X25 @ X27)))))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X11 @ X12) @ X25) @ X26))))))))&![X28:$i]:(((mem @ X28 @ (arr @ X11 @ X12))=>![X29:$i]:(((mem @ X29 @ (arr @ X12 @ bool))=>((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X11 @ X12) @ X28) @ X29))<=>![X30:$i]:(((mem @ X30 @ X12)=>((p @ (ap @ X29 @ X30))=>?[X31:$i]:(((mem @ X31 @ X11)&((X30)=(ap @ X28 @ X31)))))))))))))&![X32:$i]:(((mem @ X32 @ (arr @ X11 @ X12))=>![X33:$i]:(((mem @ X33 @ (arr @ X12 @ bool))=>(![X34:$i]:(((mem @ X34 @ X12)=>(~(p @ (ap @ X33 @ X34))=>?[X35:$i]:((((X34)=(ap @ X32 @ X35))&(mem @ X35 @ X11))))))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X11 @ X12) @ X32) @ X33))))))))&![X36:$i]:(((mem @ X36 @ (arr @ X11 @ X12))=>![X37:$i]:(((mem @ X37 @ (arr @ X12 @ bool))=>(![X38:$i]:(((mem @ X38 @ X11)=>~(p @ (ap @ X37 @ (ap @ X36 @ X38)))))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X11 @ X12) @ X36) @ X37))))))))&((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X11 @ X12) @ X13) @ X14))<=>![X39:$i]:(((mem @ X39 @ X12)=>(~(p @ (ap @ X14 @ X39))=>?[X40:$i]:(((mem @ X40 @ X11)&~(p @ (ap @ X14 @ (ap @ X13 @ X40)))))))))))), inference(split_equiv,[status(thm)],[c_0_3])). 1.28/0.65 thf(c_0_9, negated_conjecture, ![X4:$i, X6:$i]:(((epred6_0)|~((epred4_4 @ X4 @ X6 @ esk2_0 @ esk1_0)))), inference(split_equiv,[status(thm)],[c_0_5])). 1.28/0.65 thf(c_0_10, plain, ![X4:$i, X1:del, X6:$i, X2:del]:(((epred4_4 @ X4 @ X6 @ X1 @ X2)|~((mem @ X4 @ (arr @ X1 @ X2)))|~((mem @ X6 @ (arr @ X2 @ bool))))), inference(split_conjunct,[status(thm)],[c_0_6])). 1.28/0.65 thf(c_0_11, negated_conjecture, ![X140:$i]:(((mem @ esk3_0 @ (arr @ esk2_0 @ esk1_0))&((mem @ esk4_0 @ (arr @ esk1_0 @ bool))&((mem @ esk5_0 @ (arr @ esk1_0 @ bool))&((~(mem @ X140 @ esk1_0)|(~(p @ (ap @ esk5_0 @ X140))|(p @ (ap @ esk4_0 @ X140))))&((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ esk1_0) @ esk3_0) @ esk4_0))&~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ esk1_0) @ esk3_0) @ esk5_0)))))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])). 1.28/0.65 thf(c_0_12, plain, ![X208:del, X209:del, X210:$i, X211:$i, X213:$i, X214:$i, X216:$i, X217:$i, X219:$i, X220:$i, X221:$i, X222:$i, X225:$i, X226:$i, X227:$i, X229:$i, X230:$i, X232:$i, X233:$i, X235:$i, X236:$i, X239:$i]:((((((((((mem @ (esk7_4 @ X208 @ X209 @ X210 @ X211) @ X209)|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X208 @ X209) @ X211) @ X210))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&(((p @ (ap @ X210 @ (esk7_4 @ X208 @ X209 @ X210 @ X211)))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X208 @ X209) @ X211) @ X210))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&(~(p @ (ap @ X210 @ (ap @ X211 @ X213)))|~(mem @ X213 @ X208)|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X208 @ X209) @ X211) @ X210))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))))&(((p @ (ap @ X210 @ (ap @ X211 @ (esk8_5 @ X208 @ X209 @ X210 @ X211 @ X214))))|~(p @ (ap @ X210 @ X214))|~(mem @ X214 @ X209)|~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X208 @ X209) @ X211) @ X210))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&((mem @ (esk8_5 @ X208 @ X209 @ X210 @ X211 @ X214) @ X208)|~(p @ (ap @ X210 @ X214))|~(mem @ X214 @ X209)|~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X208 @ X209) @ X211) @ X210))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))))&((((mem @ (esk9_6 @ X208 @ X209 @ X210 @ X211 @ X216 @ X217) @ X208)|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X208 @ X209) @ X216) @ X217))|~(mem @ X217 @ (arr @ X209 @ bool))|~(mem @ X216 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&(~(p @ (ap @ X217 @ (ap @ X216 @ (esk9_6 @ X208 @ X209 @ X210 @ X211 @ X216 @ X217))))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X208 @ X209) @ X216) @ X217))|~(mem @ X217 @ (arr @ X209 @ bool))|~(mem @ X216 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209)))&(~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X208 @ X209) @ X216) @ X217))|(~(mem @ X219 @ X208)|(p @ (ap @ X217 @ (ap @ X216 @ X219))))|~(mem @ X217 @ (arr @ X209 @ bool))|~(mem @ X216 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))))&((((mem @ (esk10_7 @ X208 @ X209 @ X210 @ X211 @ X220 @ X221 @ X222) @ X208)|~(p @ (ap @ X221 @ X222))|~(mem @ X222 @ X209)|~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X208 @ X209) @ X220) @ X221))|~(mem @ X221 @ (arr @ X209 @ bool))|~(mem @ X220 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&(((X222)=(ap @ X220 @ (esk10_7 @ X208 @ X209 @ X210 @ X211 @ X220 @ X221 @ X222)))|~(p @ (ap @ X221 @ X222))|~(mem @ X222 @ X209)|~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X208 @ X209) @ X220) @ X221))|~(mem @ X221 @ (arr @ X209 @ bool))|~(mem @ X220 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209)))&(((mem @ (esk11_6 @ X208 @ X209 @ X210 @ X211 @ X220 @ X221) @ X209)|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X208 @ X209) @ X220) @ X221))|~(mem @ X221 @ (arr @ X209 @ bool))|~(mem @ X220 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&(((p @ (ap @ X221 @ (esk11_6 @ X208 @ X209 @ X210 @ X211 @ X220 @ X221)))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X208 @ X209) @ X220) @ X221))|~(mem @ X221 @ (arr @ X209 @ bool))|~(mem @ X220 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&(~(mem @ X225 @ X208)|((esk11_6 @ X208 @ X209 @ X210 @ X211 @ X220 @ X221)!=(ap @ X220 @ X225))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X208 @ X209) @ X220) @ X221))|~(mem @ X221 @ (arr @ X209 @ bool))|~(mem @ X220 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))))))&((((mem @ (esk12_6 @ X208 @ X209 @ X210 @ X211 @ X226 @ X227) @ X209)|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X208 @ X209) @ X226) @ X227))|~(mem @ X227 @ (arr @ X209 @ bool))|~(mem @ X226 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&((~(p @ (ap @ X227 @ (esk12_6 @ X208 @ X209 @ X210 @ X211 @ X226 @ X227)))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X208 @ X209) @ X226) @ X227))|~(mem @ X227 @ (arr @ X209 @ bool))|~(mem @ X226 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&(((esk12_6 @ X208 @ X209 @ X210 @ X211 @ X226 @ X227)!=(ap @ X226 @ X229))|~(mem @ X229 @ X208)|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X208 @ X209) @ X226) @ X227))|~(mem @ X227 @ (arr @ X209 @ bool))|~(mem @ X226 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))))&((((X230)=(ap @ X226 @ (esk13_7 @ X208 @ X209 @ X210 @ X211 @ X226 @ X227 @ X230)))|(p @ (ap @ X227 @ X230))|~(mem @ X230 @ X209)|~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X208 @ X209) @ X226) @ X227))|~(mem @ X227 @ (arr @ X209 @ bool))|~(mem @ X226 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&((mem @ (esk13_7 @ X208 @ X209 @ X210 @ X211 @ X226 @ X227 @ X230) @ X208)|(p @ (ap @ X227 @ X230))|~(mem @ X230 @ X209)|~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X208 @ X209) @ X226) @ X227))|~(mem @ X227 @ (arr @ X209 @ bool))|~(mem @ X226 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209)))))&((((mem @ (esk14_6 @ X208 @ X209 @ X210 @ X211 @ X232 @ X233) @ X208)|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X208 @ X209) @ X232) @ X233))|~(mem @ X233 @ (arr @ X209 @ bool))|~(mem @ X232 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&((p @ (ap @ X233 @ (ap @ X232 @ (esk14_6 @ X208 @ X209 @ X210 @ X211 @ X232 @ X233))))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X208 @ X209) @ X232) @ X233))|~(mem @ X233 @ (arr @ X209 @ bool))|~(mem @ X232 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209)))&(~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X208 @ X209) @ X232) @ X233))|(~(mem @ X235 @ X208)|~(p @ (ap @ X233 @ (ap @ X232 @ X235))))|~(mem @ X233 @ (arr @ X209 @ bool))|~(mem @ X232 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))))&((((mem @ (esk15_5 @ X208 @ X209 @ X210 @ X211 @ X236) @ X208)|(p @ (ap @ X210 @ X236))|~(mem @ X236 @ X209)|~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X208 @ X209) @ X211) @ X210))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&(~(p @ (ap @ X210 @ (ap @ X211 @ (esk15_5 @ X208 @ X209 @ X210 @ X211 @ X236))))|(p @ (ap @ X210 @ X236))|~(mem @ X236 @ X209)|~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X208 @ X209) @ X211) @ X210))|~(epred4_4 @ X211 @ X210 @ X208 @ X209)))&(((mem @ (esk16_4 @ X208 @ X209 @ X210 @ X211) @ X209)|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X208 @ X209) @ X211) @ X210))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&((~(p @ (ap @ X210 @ (esk16_4 @ X208 @ X209 @ X210 @ X211)))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X208 @ X209) @ X211) @ X210))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&(~(mem @ X239 @ X208)|(p @ (ap @ X210 @ (ap @ X211 @ X239)))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X208 @ X209) @ X211) @ X210))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])])). 1.28/0.65 thf(c_0_13, negated_conjecture, ![X4:$i, X6:$i]:(((epred6_0)|~((mem @ X4 @ (arr @ esk1_0 @ bool)))|~((mem @ X6 @ (arr @ esk2_0 @ esk1_0))))), inference(spm,[status(thm)],[c_0_9, c_0_10])). 1.28/0.65 thf(c_0_14, negated_conjecture, (mem @ esk5_0 @ (arr @ esk1_0 @ bool)), inference(split_conjunct,[status(thm)],[c_0_11])). 1.28/0.65 thf(c_0_15, plain, ![X1:del, X2:del, X6:$i]:(((mem @ X6 @ (arr @ X1 @ X2))=>![X4:$i]:(((mem @ X4 @ X1)=>(mem @ (ap @ X6 @ X4) @ X2))))), inference(fof_simplification,[status(thm)],[ap_tp])). 1.28/0.65 thf(c_0_16, plain, ![X4:$i, X1:del, X8:$i, X6:$i, X2:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X1 @ X2) @ X6) @ X4))|~((p @ (ap @ X4 @ (ap @ X6 @ X8))))|~((mem @ X8 @ X1))|~((epred4_4 @ X6 @ X4 @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_12])). 1.28/0.65 thf(c_0_17, plain, ![X4:$i, X1:del, X9:$i, X8:$i, X6:$i, X2:del]:(((p @ (ap @ X4 @ (ap @ X6 @ (esk14_6 @ X1 @ X2 @ X8 @ X9 @ X6 @ X4))))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X2) @ X6) @ X4))|~((mem @ X4 @ (arr @ X2 @ bool)))|~((mem @ X6 @ (arr @ X1 @ X2)))|~((epred4_4 @ X9 @ X8 @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_12])). 1.28/0.65 thf(c_0_18, plain, (~((epred5_0))<=>![X4:$i]:((~((mem @ X4 @ esk2_0))|~((p @ (ap @ esk4_0 @ (ap @ esk3_0 @ X4))))))), introduced(definition)). 1.28/0.65 thf(c_0_19, plain, ![X4:$i, X1:del, X8:$i, X10:$i, X9:$i, X6:$i, X2:del]:((~((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X2) @ X4) @ X6)))|~((mem @ X8 @ X1))|~((p @ (ap @ X6 @ (ap @ X4 @ X8))))|~((mem @ X6 @ (arr @ X2 @ bool)))|~((mem @ X4 @ (arr @ X1 @ X2)))|~((epred4_4 @ X9 @ X10 @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_12])). 1.28/0.65 thf(c_0_20, negated_conjecture, (p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ esk1_0) @ esk3_0) @ esk4_0)), inference(split_conjunct,[status(thm)],[c_0_11])). 1.28/0.65 thf(c_0_21, negated_conjecture, (mem @ esk4_0 @ (arr @ esk1_0 @ bool)), inference(split_conjunct,[status(thm)],[c_0_11])). 1.28/0.65 thf(c_0_22, negated_conjecture, (mem @ esk3_0 @ (arr @ esk2_0 @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_11])). 1.28/0.65 thf(c_0_23, negated_conjecture, ![X4:$i]:(((epred6_0)|~((mem @ X4 @ (arr @ esk2_0 @ esk1_0))))), inference(spm,[status(thm)],[c_0_13, c_0_14])). 1.28/0.65 thf(c_0_24, plain, ![X141:del, X142:del, X143:$i, X144:$i]:((~(mem @ X143 @ (arr @ X141 @ X142))|(~(mem @ X144 @ X141)|(mem @ (ap @ X143 @ X144) @ X142)))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])])). 1.28/0.65 thf(c_0_25, plain, ![X4:$i, X1:del, X12:del, X11:del, X9:$i, X8:$i, X6:$i, X2:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X2) @ X4) @ X6))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X11 @ X12) @ X4) @ X6))|~((mem @ (esk14_6 @ X1 @ X2 @ X8 @ X9 @ X4 @ X6) @ X11))|~((mem @ X6 @ (arr @ X2 @ bool)))|~((mem @ X4 @ (arr @ X1 @ X2)))|~((epred4_4 @ X4 @ X6 @ X11 @ X12))|~((epred4_4 @ X9 @ X8 @ X1 @ X2)))), inference(spm,[status(thm)],[c_0_16, c_0_17])). 1.28/0.65 thf(c_0_26, plain, ![X4:$i, X1:del, X9:$i, X8:$i, X6:$i, X2:del]:(((mem @ (esk14_6 @ X1 @ X2 @ X4 @ X6 @ X8 @ X9) @ X1)|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X2) @ X8) @ X9))|~((mem @ X9 @ (arr @ X2 @ bool)))|~((mem @ X8 @ (arr @ X1 @ X2)))|~((epred4_4 @ X6 @ X4 @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_12])). 1.28/0.65 thf(c_0_27, negated_conjecture, ![X4:$i]:(((p @ (ap @ esk4_0 @ X4))|~((mem @ X4 @ esk1_0))|~((p @ (ap @ esk5_0 @ X4))))), inference(split_conjunct,[status(thm)],[c_0_11])). 1.28/0.65 thf(c_0_28, plain, ![X4:$i, X1:del, X8:$i, X6:$i, X2:del]:(((p @ (ap @ X4 @ (ap @ X6 @ (esk8_5 @ X1 @ X2 @ X4 @ X6 @ X8))))|~((p @ (ap @ X4 @ X8)))|~((mem @ X8 @ X2))|~((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X1 @ X2) @ X6) @ X4)))|~((epred4_4 @ X6 @ X4 @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_12])). 1.28/0.65 thf(c_0_29, negated_conjecture, (~((epred6_0))|~((epred5_0))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_21]), c_0_22])]), c_0_18]), c_0_5])). 1.28/0.65 thf(c_0_30, negated_conjecture, (epred6_0), inference(spm,[status(thm)],[c_0_23, c_0_22])). 1.28/0.65 thf(c_0_31, plain, ![X4:$i, X6:$i, X2:del, X1:del]:(((mem @ (ap @ X4 @ X6) @ X2)|~((mem @ X4 @ (arr @ X1 @ X2)))|~((mem @ X6 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_24])). 1.28/0.65 thf(c_0_32, plain, ![X4:$i, X6:$i, X2:del, X1:del, X9:$i, X8:$i, X11:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X1 @ X2) @ X4) @ X6))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X11) @ X4) @ X6))|~((mem @ X6 @ (arr @ X11 @ bool)))|~((mem @ X4 @ (arr @ X1 @ X11)))|~((epred4_4 @ X4 @ X6 @ X1 @ X2))|~((epred4_4 @ X8 @ X9 @ X1 @ X11)))), inference(spm,[status(thm)],[c_0_25, c_0_26])). 1.28/0.65 thf(c_0_33, negated_conjecture, ![X4:$i]:(((epred5_0)|~((p @ (ap @ esk4_0 @ (ap @ esk3_0 @ X4))))|~((mem @ X4 @ esk2_0)))), inference(split_equiv,[status(thm)],[c_0_18])). 1.28/0.65 thf(c_0_34, negated_conjecture, ![X4:$i, X1:del, X6:$i, X2:del]:(((p @ (ap @ esk4_0 @ (ap @ X4 @ (esk8_5 @ X1 @ X2 @ esk5_0 @ X4 @ X6))))|~((mem @ (ap @ X4 @ (esk8_5 @ X1 @ X2 @ esk5_0 @ X4 @ X6)) @ esk1_0))|~((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X1 @ X2) @ X4) @ esk5_0)))|~((p @ (ap @ esk5_0 @ X6)))|~((epred4_4 @ X4 @ esk5_0 @ X1 @ X2))|~((mem @ X6 @ X2)))), inference(spm,[status(thm)],[c_0_27, c_0_28])). 1.28/0.65 thf(c_0_35, negated_conjecture, ~((epred5_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29, c_0_30])])). 1.28/0.65 thf(c_0_36, negated_conjecture, ![X4:$i]:(((mem @ (ap @ esk3_0 @ X4) @ esk1_0)|~((mem @ X4 @ esk2_0)))), inference(spm,[status(thm)],[c_0_31, c_0_22])). 1.28/0.65 thf(c_0_37, plain, ![X4:$i, X2:del, X1:del, X8:$i, X9:$i, X6:$i, X11:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X2) @ X4) @ X6))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X1 @ X11) @ X4) @ X6))|~((mem @ X6 @ (arr @ X2 @ bool)))|~((mem @ X8 @ (arr @ X2 @ bool)))|~((mem @ X4 @ (arr @ X1 @ X2)))|~((mem @ X9 @ (arr @ X1 @ X2)))|~((epred4_4 @ X4 @ X6 @ X1 @ X11)))), inference(spm,[status(thm)],[c_0_32, c_0_10])). 1.28/0.65 thf(c_0_38, negated_conjecture, ![X4:$i, X1:del, X2:del]:((~((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X1 @ X2) @ esk3_0) @ esk5_0)))|~((mem @ (esk8_5 @ X1 @ X2 @ esk5_0 @ esk3_0 @ X4) @ esk2_0))|~((epred4_4 @ esk3_0 @ esk5_0 @ X1 @ X2))|~((p @ (ap @ esk5_0 @ X4)))|~((mem @ X4 @ X2)))), inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_35]), c_0_36])). 1.28/0.65 thf(c_0_39, plain, ![X4:$i, X1:del, X8:$i, X6:$i, X2:del]:(((mem @ (esk8_5 @ X1 @ X2 @ X4 @ X6 @ X8) @ X1)|~((p @ (ap @ X4 @ X8)))|~((mem @ X8 @ X2))|~((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X1 @ X2) @ X6) @ X4)))|~((epred4_4 @ X6 @ X4 @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_12])). 1.28/0.65 thf(c_0_40, negated_conjecture, ![X4:$i, X1:del, X8:$i, X6:$i, X2:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ esk1_0) @ X4) @ X6))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X1 @ X2) @ X4) @ X6))|~((mem @ X6 @ (arr @ esk1_0 @ bool)))|~((mem @ X4 @ (arr @ X1 @ esk1_0)))|~((mem @ X8 @ (arr @ X1 @ esk1_0)))|~((epred4_4 @ X4 @ X6 @ X1 @ X2)))), inference(spm,[status(thm)],[c_0_37, c_0_14])). 1.28/0.65 thf(c_0_41, plain, ![X4:$i, X1:del]:((~((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ esk2_0 @ X1) @ esk3_0) @ esk5_0)))|~((epred4_4 @ esk3_0 @ esk5_0 @ esk2_0 @ X1))|~((p @ (ap @ esk5_0 @ X4)))|~((mem @ X4 @ X1)))), inference(spm,[status(thm)],[c_0_38, c_0_39])). 1.28/0.65 thf(c_0_42, negated_conjecture, ![X4:$i, X6:$i, X1:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ esk1_0) @ X4) @ X6))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ esk2_0 @ X1) @ X4) @ X6))|~((mem @ X6 @ (arr @ esk1_0 @ bool)))|~((mem @ X4 @ (arr @ esk2_0 @ esk1_0)))|~((epred4_4 @ X4 @ X6 @ esk2_0 @ X1)))), inference(spm,[status(thm)],[c_0_40, c_0_22])). 1.28/0.65 thf(c_0_43, negated_conjecture, ~((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ esk1_0) @ esk3_0) @ esk5_0))), inference(split_conjunct,[status(thm)],[c_0_11])). 1.28/0.65 thf(c_0_44, plain, ![X4:$i, X1:del]:((~((epred4_4 @ esk3_0 @ esk5_0 @ esk2_0 @ X1))|~((p @ (ap @ esk5_0 @ X4)))|~((mem @ X4 @ X1)))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41, c_0_42]), c_0_14]), c_0_22])]), c_0_43])). 1.28/0.65 thf(c_0_45, plain, ![X4:$i, X1:del]:((~((mem @ esk5_0 @ (arr @ X1 @ bool)))|~((mem @ esk3_0 @ (arr @ esk2_0 @ X1)))|~((p @ (ap @ esk5_0 @ X4)))|~((mem @ X4 @ X1)))), inference(spm,[status(thm)],[c_0_44, c_0_10])). 1.28/0.65 thf(c_0_46, negated_conjecture, ![X4:$i]:((~((p @ (ap @ esk5_0 @ X4)))|~((mem @ X4 @ esk1_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45, c_0_22]), c_0_14])])). 1.28/0.65 thf(c_0_47, plain, ![X4:$i, X1:del, X8:$i, X6:$i, X2:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X2) @ X4) @ esk5_0))|~((mem @ (ap @ X4 @ (esk14_6 @ X1 @ X2 @ X6 @ X8 @ X4 @ esk5_0)) @ esk1_0))|~((mem @ esk5_0 @ (arr @ X2 @ bool)))|~((mem @ X4 @ (arr @ X1 @ X2)))|~((epred4_4 @ X8 @ X6 @ X1 @ X2)))), inference(spm,[status(thm)],[c_0_46, c_0_17])). 1.28/0.65 thf(c_0_48, negated_conjecture, ![X4:$i, X1:del, X6:$i, X2:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X2) @ esk3_0) @ esk5_0))|~((mem @ (esk14_6 @ X1 @ X2 @ X4 @ X6 @ esk3_0 @ esk5_0) @ esk2_0))|~((mem @ esk5_0 @ (arr @ X2 @ bool)))|~((mem @ esk3_0 @ (arr @ X1 @ X2)))|~((epred4_4 @ X6 @ X4 @ X1 @ X2)))), inference(spm,[status(thm)],[c_0_47, c_0_36])). 1.28/0.65 thf(c_0_49, plain, ![X4:$i, X6:$i, X1:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ X1) @ esk3_0) @ esk5_0))|~((mem @ esk5_0 @ (arr @ X1 @ bool)))|~((mem @ esk3_0 @ (arr @ esk2_0 @ X1)))|~((epred4_4 @ X4 @ X6 @ esk2_0 @ X1)))), inference(spm,[status(thm)],[c_0_48, c_0_26])). 1.28/0.65 thf(c_0_50, plain, ![X4:$i, X6:$i, X1:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ X1) @ esk3_0) @ esk5_0))|~((mem @ esk5_0 @ (arr @ X1 @ bool)))|~((mem @ esk3_0 @ (arr @ esk2_0 @ X1)))|~((mem @ X4 @ (arr @ X1 @ bool)))|~((mem @ X6 @ (arr @ esk2_0 @ X1))))), inference(spm,[status(thm)],[c_0_49, c_0_10])). 1.28/0.65 thf(c_0_51, negated_conjecture, ![X4:$i]:(~((mem @ X4 @ (arr @ esk2_0 @ esk1_0)))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50, c_0_14]), c_0_14]), c_0_22])]), c_0_43])). 1.28/0.65 thf(c_0_52, negated_conjecture, ($false), inference(sr,[status(thm)],[c_0_22, c_0_51]), ['proof']). 1.28/0.65 # SZS output end CNFRefutation 1.28/0.65 # Parsed axioms : 75 1.28/0.65 # Removed by relevancy pruning/SinE : 48 1.28/0.65 # Initial clauses : 282 1.28/0.65 # Removed in clause preprocessing : 213 1.28/0.65 # Initial clauses in saturation : 69 1.28/0.65 # Processed clauses : 511 1.28/0.65 # ...of these trivial : 0 1.28/0.65 # ...subsumed : 101 1.28/0.65 # ...remaining for further processing : 410 1.28/0.65 # Other redundant clauses eliminated : 0 1.28/0.65 # Clauses deleted for lack of memory : 0 1.28/0.65 # Backward-subsumed : 12 1.28/0.65 # Backward-rewritten : 3 1.28/0.65 # Generated clauses : 4046 1.28/0.65 # ...of the previous two non-redundant : 3979 1.28/0.65 # ...aggressively subsumed : 0 1.28/0.65 # Contextual simplify-reflections : 1 1.28/0.65 # Paramodulations : 4041 1.28/0.65 # Factorizations : 0 1.28/0.65 # NegExts : 0 1.28/0.65 # Equation resolutions : 1 1.28/0.65 # Disequality decompositions : 0 1.28/0.65 # Total rewrite steps : 182 1.28/0.65 # ...of those cached : 177 1.28/0.65 # Propositional unsat checks : 0 1.28/0.65 # Propositional check models : 0 1.28/0.65 # Propositional check unsatisfiable : 0 1.28/0.65 # Propositional clauses : 0 1.28/0.65 # Propositional clauses after purity: 0 1.28/0.65 # Propositional unsat core size : 0 1.28/0.65 # Propositional preprocessing time : 0.000 1.28/0.65 # Propositional encoding time : 0.000 1.28/0.65 # Propositional solver time : 0.000 1.28/0.65 # Success case prop preproc time : 0.000 1.28/0.65 # Success case prop encoding time : 0.000 1.28/0.65 # Success case prop solver time : 0.000 1.28/0.65 # Current number of processed clauses : 393 1.28/0.65 # Positive orientable unit clauses : 10 1.28/0.65 # Positive unorientable unit clauses: 0 1.28/0.65 # Negative unit clauses : 3 1.28/0.65 # Non-unit-clauses : 380 1.28/0.65 # Current number of unprocessed clauses: 3516 1.28/0.65 # ...number of literals in the above : 30730 1.28/0.65 # Current number of archived formulas : 0 1.28/0.65 # Current number of archived clauses : 16 1.28/0.65 # Clause-clause subsumption calls (NU) : 26615 1.28/0.65 # Rec. Clause-clause subsumption calls : 4162 1.28/0.65 # Non-unit clause-clause subsumptions : 111 1.28/0.65 # Unit Clause-clause subsumption calls : 390 1.28/0.65 # Rewrite failures with RHS unbound : 0 1.28/0.65 # BW rewrite match attempts : 1 1.28/0.65 # BW rewrite match successes : 1 1.28/0.65 # Condensation attempts : 0 1.28/0.65 # Condensation successes : 0 1.28/0.65 # Termbank termtop insertions : 191648 1.28/0.65 # Search garbage collected termcells : 4786 1.28/0.65 1.28/0.65 # ------------------------------------------------- 1.28/0.65 # User time : 0.149 s 1.28/0.65 # System time : 0.006 s 1.28/0.65 # Total time : 0.155 s 1.28/0.65 # Maximum resident set size: 2804 pages 1.28/0.65 1.28/0.65 # ------------------------------------------------- 1.28/0.65 # User time : 0.152 s 1.28/0.65 # System time : 0.008 s 1.28/0.65 # Total time : 0.161 s 1.28/0.65 # Maximum resident set size: 1864 pages 1.28/0.65 % E exiting 1.28/0.65 % E exiting 1.28/0.65 EOF